#include <string>
#include "Map.h"
	void test_map()
	{
		int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
    bit::Map<int, int> m;
		for (auto e : a)
		{
			m.insert(make_pair(e, e));
		}
    auto it = m.begin();
    while(it != m.end())
    {
      cout << (*it).first << " ";
      ++it;
    }
    cout << endl;

	}

int main()
{
	//TestAVLTree2();
	//TestRBTree1();

	test_map();

	return 0;
}
